﻿using System;
using System.Collections.Generic;
using System.Linq;
using System.Threading.Tasks;

namespace Algorithm_api.calculate.StrongLine
{
    public class MapData
    {

        public int num { get; }
        public Graph[] graphs { get; set; } 
        public Dictionary<string,string>[] dics { get; set; }
        public string[][] Vs { get; set; }

        public MapData()
        {
            
            string[] v1 = { "a", "b", "c", "d", "e", "f", "g", "h" };
            
            string[] v2 = { "1", "2", "3", "4", "5", "6" };
            Graph g1 = new Graph(v1.Length);
            Graph g2 = new Graph(v2.Length);
            graphs = new Graph[2];
            foreach(var v in v1)
            {
                g1.AddVertex(v);
            }

            foreach(var v in v2)
            {
                g2.AddVertex(v);
            }
            
            g1.AddEdge("a", "b");
            g1.AddEdge("f", "a");
            g1.AddEdge("f", "b");
            g1.AddEdge("b", "g");
            g1.AddEdge("g", "f");
            g1.AddEdge("d", "b");
            g1.AddEdge("d", "g");
            g1.AddEdge("c", "d");
            g1.AddEdge("h", "d");
            g1.AddEdge("h", "c");
            g1.AddEdge("c", "e");
            g1.AddEdge("e", "h");

            g2.AddEdge("1", "2");
            g2.AddEdge("2", "3");
            g2.AddEdge("3", "5");
            g2.AddEdge("5", "6");
            g2.AddEdge("3", "4");
            g2.AddEdge("4", "2");

            graphs[0] = g1;
            graphs[1] = g2;
            num = graphs.Length;
        }

        
    }
}
